Lower bounds for the maximum genus of 4-regular graphs∗
نویسندگان
چکیده
This paper investigates the maximum genus and upper embeddability of connected 4-regular graphs. We obtain lower bounds on the maximum genus of connected 4-regular simple graphs and connected 4-regular graphs without loops in terms of the Betti number. The definition of the Betti number is referred to [Gross and Tucker, Topological Graph Theory, New York, 1987]. Furthermore, we give examples that show that these lower bounds are tight.
منابع مشابه
New bounds on proximity and remoteness in graphs
The average distance of a vertex $v$ of a connected graph $G$is the arithmetic mean of the distances from $v$ to allother vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$of $G$ are defined as the minimum and maximum averagedistance of the vertices of $G$. In this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...
متن کاملTight Lower Bounds on the Size of a Maximum Matching in a Regular Graph
In this paper we study tight lower bounds on the size of a maximum matching in a regular graph. For k ≥ 3, let G be a connected k-regular graph of order n and let α′(G) be the size of a maximum matching in G. We show that if k is even, then α′(G) ≥ min {( k2+4 k2+k+2 ) × n2 , n−1 2 } , while if k is odd, then α′(G) ≥ (k3−k2−2) n−2k+2 2(k3−3k) . We show that both bounds are tight.
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملBounds on the max and min bisection of random cubic and random 4-regular graphs
In this paper, we present a randomized algorithm to compute the bisection width of cubic and 4-regular graphs. The analysis of the proposed algorithms on random graphs provides asymptotic upper bounds for the bisection width of random cubic and random 4-regular graphs with n vertices, giving upper bounds of 0:174039n for random cubic, and of 0:333333n for random 4-regular. We also obtain asympt...
متن کاملThe analysis of a prioritised probabilistic algorithm to find large induced forests in regular graphs with large girth
The analysis of probabilistic algorithms has proved to be very successful for finding asymptotic bounds on parameters of random regular graphs. In this paper, we show that similar ideas may be used to obtain deterministic bounds for one such parameter in the case of regular graphs with large girth. More precisely, we address the problem of finding a large induced forest in a graph G, by which w...
متن کامل